Controllability, Matching Ratio and Graph Convergence

Convergence of a Hill Climbing Genetic Algorithm for Graph Matching

This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorporated a hill-climbing step. In the present study we return to the algorithm and provide some the...

Graph Similarity and Matching

Measures of graph similarity have a broad array of applications, including comparing chemical structures, navigating complex networks like the World Wide Web, and more recently, analyzing different kinds of biological data. This thesis surveys several different notions of similarity, then focuses on an interesting class of iterative algorithms that use the structural similarity of local neighbo...

Graph Unification and Matching

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

Structural controllability: an undirected graph approach

This paper addresses questions regarding controllability for ‘generic parameter’ dynamical systems, i.e. the question whether a dynamical system is ‘structurally controllable’. Unlike conventional methods that deal with structural controllability, our approach uses an undirected graph: the behavioral approach to modelling dynamical systems allows this. Given a system of linear, constant coeffic...